586 research outputs found
Massive MIMO Full-Duplex Relaying with Optimal Power Allocation for Independent Multipairs
With the help of an in-band full-duplex relay station, it is possible to
simultaneously transmit and receive signals from multiple users. The
performance of such system can be greatly increased when the relay station is
equipped with a large number of antennas on both transmitter and receiver
sides. In this paper, we exploit the use of massive arrays to effectively
suppress the loopback interference (LI) of a decode-and-forward relay (DF) and
evaluate the performance of the end-to-end (e2e) transmission. This paper
assumes imperfect channel state information is available at the relay and
designs a minimum mean-square error (MMSE) filter to mitigate the interference.
Subsequently, we adopt zero-forcing (ZF) filters for both detection and
beamforming. The performance of such system is evaluated in terms of bit error
rate (BER) at both relay and destinations, and an optimal choice for the
transmission power at the relay is shown. We then propose a complexity
efficient optimal power allocation (OPA) algorithm that, using the channel
statistics, computes the minimum power that satisfies the rate constraints of
each pair. The results obtained via simulation show that when both MMSE
filtering and OPA method are used, better values for the energy efficiency are
attained.Comment: Accepted to the 16th IEEE International Workshop on Signal Processing
Advances in Wireless Communications - SPAWC, Stockholm, Sweden 201
Full-Duplex Relaying in MIMO-OFDM Frequency-Selective Channels with Optimal Adaptive Filtering
In-band full-duplex transmission allows a relay station to theoretically
double its spectral efficiency by simultaneously receiving and transmitting in
the same frequency band, when compared to the traditional half-duplex or
out-of-band full-duplex counterpart. Consequently, the induced
self-interference suffered by the relay may reach considerable power levels,
which decreases the signal-to-interference-plus-noise ratio (SINR) in a
decode-and-forward (DF) relay, leading to a degradation of the relay
performance. This paper presents a technique to cope with the problem of
self-interference in broadband multiple-input multiple-output (MIMO) relays.
The proposed method uses a time-domain cancellation in a DF relay, where a
replica of the interfering signal is created with the help of a recursive least
squares (RLS) algorithm that estimates the interference frequency-selective
channel. Its convergence mean time is shown to be negligible by simulation
results, when compared to the length of a typical orthogonal-frequency division
multiplexing (OFDM) sequences. Moreover, the bit-error-rate (BER) and the SINR
in a OFDM transmission are evaluated, confirming that the proposed method
extends significantly the range of self-interference power to which the relay
is resilient to, when compared with other mitigation schemes
Symbol-Level GRAND for High-Order Modulation over Flat Fading Channels
Guessing random additive noise decoding (GRAND) is a noise-centric decoding
method, which is suitable for ultra-reliable low-latency communications, as it
supports high-rate error correction codes that generate short-length codewords.
GRAND estimates transmitted codewords by guessing the error patterns that
altered them during transmission. The guessing process requires the generation
and testing of error patterns that are arranged in increasing order of Hamming
weight. This approach is fitting for binary transmission over additive white
Gaussian noise channels. This letter considers transmission of coded and
modulated data over flat fading channels and proposes a variant of GRAND, which
leverages information on the modulation scheme and the fading channel. In the
core of the proposed variant, referred to as symbol-level GRAND, is an
analytical expression that computes the probability of occurrence of an error
pattern and determines the order with which error patterns are tested.
Simulation results demonstrate that symbol-level GRAND produces estimates of
the transmitted codewords notably faster than the original GRAND at the cost of
a small increase in memory requirements.Comment: 5 pages, 5 figures, 1 tabl
Entanglement Routing Based on Fidelity Curves for Quantum Photonics Channels
The quantum internet promises to extend entanglement correlations from nearby
neighbors to any two nodes in a network. How to efficiently distribute
entanglement over large-scale networks is still an open problem that greatly
depends on the technology considered. In this work, we consider quantum
networks composed of photonic channels characterized by a trade-off between the
entanglement generation rate and fidelity. For such networks we look at the two
following problems: the one of finding the best path to connect any two given
nodes in the network bipartite entanglement routing, and the problem of finding
the best starting node in order to connect three nodes in the network
multipartite entanglement routing. We consider two entanglement distribution
models: one where entangled qubit are distributed one at a time, and a flow
model where a large number of entangled qubits are distributed simultaneously.
We propose the use of continuous fidelity curves (i.e., entanglement generation
fidelity vs rate) as the main routing metric. Combined with multi-objective
path-finding algorithms, the fidelity curves describing each link allow finding
a set of paths that maximize both the end-to-end fidelity and the entanglement
generation rate. For the models and networks considered, we prove that the
algorithm always converges to the optimal solution, and we show through
simulation that its execution time grows polynomial with the number of nodes in
the network. Our implementation grows with the number of nodes with a power
between and depending on the network. This work paves the way for the
development of path-finding algorithms for networks with complex entanglement
distribution protocols, in particular for other protocols that exhibit a
trade-off between generation fidelity and rate, such as repeater-and-purify
protocols
URLLC with Coded Massive MIMO via Random Linear Codes and GRAND
A present challenge in wireless communications is the assurance of
ultra-reliable and low-latency communication (URLLC). While the reliability
aspect is well known to be improved by channel coding with long codewords, this
usually implies using interleavers, which introduce undesirable delay. Using
short codewords is a needed change to minimizing the decoding delay. This work
proposes the combination of a coding and decoding scheme to be used along with
spatial signal processing as a means to provide URLLC over a fading channel.
The paper advocates the use of random linear codes (RLCs) over a massive MIMO
(mMIMO) channel with standard zero-forcing detection and guessing random
additive noise decoding (GRAND). The performance of several schemes is assessed
over a mMIMO flat fading channel. The proposed scheme greatly outperforms the
equivalent scheme using 5G's polar encoding and decoding for signal-to-noise
ratios (SNR) of interest. While the complexity of the polar code is constant at
all SNRs, using RLCs with GRAND achieves much faster decoding times for most of
the SNR range, further reducing latency
Symbol-Level Noise-Guessing Decoding with Antenna Sorting for URLLC Massive MIMO
Supporting ultra-reliable and low-latency communication (URLLC) is a
challenge in current wireless systems. Channel codes that generate large
codewords improve reliability but necessitate the use of interleavers, which
introduce undesirable latency. Only short codewords can eliminate the
requirement for interleaving and reduce decoding latency. This paper suggests a
coding and decoding method which, when combined with the high spectral
efficiency of spatial multiplexing, can provide URLLC over a fading channel.
Random linear coding and high-order modulation are used to transmit information
over a massive multiple-input multiple-output (mMIMO) channel, followed by
zero-forcing detection and guessing random additive noise decoding (GRAND) at a
receiver. A variant of GRAND, called symbol-level GRAND, originally proposed
for single-antenna systems that employ high-order modulation schemes, is
generalized to spatial multiplexing. The paper studies the impact of the
orthogonality defect of the underlying mMIMO lattice on symbol-level GRAND, and
proposes to leverage side-information that comes from the mMIMO channel-state
information and relates to the reliability of each receive antenna. This
induces an antenna sorting step, which further reduces decoding complexity by
over 80\% when compared to bit-level GRAND
Quantum Error Correction via Noise Guessing Decoding
Quantum error correction codes (QECCs) play a central role both in quantum
communications and in quantum computation, given how error-prone quantum
technologies are. Practical quantum error correction codes, such as stabilizer
codes, are generally structured to suit a specific use, and present rigid code
lengths and code rates, limiting their adaptability to changing requirements.
This paper shows that it is possible to both construct and decode QECCs that
can attain the maximum performance of the finite blocklength regime, for any
chosen code length and when the code rate is sufficiently high. A recently
proposed strategy for decoding classical codes called GRAND (guessing random
additive noise decoding) opened doors to decoding classical random linear codes
(RLCs) that perform near the capacity of the finite blocklength regime. By
making use of the noise statistics, GRAND is a noise-centric efficient
universal decoder for classical codes, providing there is a simple code
membership test. These conditions are particularly suitable for quantum systems
and therefore the paper extends these concepts to quantum random linear codes
(QRLCs), which were known to be possible to construct but whose decoding was
not yet feasible. By combining QRLCs and a newly proposed quantum GRAND, this
paper shows that decoding versatile quantum error correction is possible,
allowing for QECCs that are simple to adapt on the fly to changing conditions.
The paper starts by assessing the minimum number of gates in the coding circuit
needed to reach the QRLCs' asymptotic performance, and subsequently proposes a
quantum GRAND algorithm that makes use of quantum noise statistics, not only to
build an adaptive code membership test, but also to efficiently implement
syndrome decoding
Efficient entanglement purification based on noise guessing decoding
In this paper, we propose a novel bipartite entanglement purification
protocol built upon hashing and upon the guessing random additive noise
decoding (GRAND) approach recently devised for classical error correction
codes. Our protocol offers substantial advantages over existing hashing
protocols, requiring fewer qubits for purification, achieving higher
fidelities, and delivering better yields with reduced computational costs. We
provide numerical and semi-analytical results to corroborate our findings and
provide a detailed comparison with the hashing protocol of Bennet et al.
Although that pioneering work devised performance bounds, it did not offer an
explicit construction for implementation. The present work fills that gap,
offering both an explicit and more efficient purification method. We
demonstrate that our protocol is capable of purifying states with noise on the
order of 10% per Bell pair even with a small ensemble of 16 pairs. The work
explores a measurement-based implementation of the protocol to address
practical setups with noise. This work opens the path to practical and
efficient entanglement purification using hashing-based methods with feasible
computational costs. Compared to the original hashing protocol, the proposed
method can achieve some desired fidelity with a number of initial resources up
to one hundred times smaller. Therefore, the proposed method seems well-fit for
future quantum networks with a limited number of resources and entails a
relatively low computational overhead.Comment: 16 page
Distributing Multipartite Entanglement over Noisy Quantum Networks
A quantum internet aims at harnessing networked quantum technologies, namely
by distributing bipartite entanglement between distant nodes. However,
multipartite entanglement between the nodes may empower the quantum internet
for additional or better applications for communications, sensing, and
computation. In this work, we present an algorithm for generating multipartite
entanglement between different nodes of a quantum network with noisy quantum
repeaters and imperfect quantum memories, where the links are entangled pairs.
Our algorithm is optimal for GHZ states with 3 qubits, maximising
simultaneously the final state fidelity and the rate of entanglement
distribution. Furthermore, we determine the conditions yielding this
simultaneous optimality for GHZ states with a higher number of qubits, and for
other types of multipartite entanglement. Our algorithm is general also in the
sense that it can optimise simultaneously arbitrary parameters. This work opens
the way to optimally generate multipartite quantum correlations over noisy
quantum networks, an important resource for distributed quantum technologies.Comment: More detailed calculations of the metrics and minor changes.
Keywords: Quantum Internet, QLANs, Multipartite Entanglement, Entanglement
Distribution, Multi-objective Routing, Quantum Network
Development of new analytical tools for monitoring of cardiovascular disease markers – towards the detection of homocysteine-thiolactone
Poster presented at the 4th International Conference on Bio-Sensing Technology, 10-13 May 2015, Lisbon, Portuga
- …